ОСОБЛИВОСТІ МЕДСЕСТРИНСЬКОГО ДОГЛЯДУ ЗА ПАЦІЄНТАМИ З СПІНАЛЬНОЮ ПАТОЛОГІЄЮ

The article adduces the peculiarities of care for patients with spinal cord lesions in Ternopil University Hospital.У статті висвітлено особливості догляду за пацієнтами з ураженням спинного мозку в КЗ ТОР «Тернопільська університетська лікарня»

ПСИХІЧНІ РОЗЛАДИ ПРИ ПУХЛИНАХ ГОЛОВНОГО МОЗКУ ТА ОРГАНІЗАЦІЯ ДОГЛЯДУ ЗА ПАЦІЄНТАМИ

The article adduces the mental disorders because of tumors of the brain and peculiarities of care for patients with mental disorders in Ternopil University Hospital.У статті висвітлено питання психічних розладів при пухлинах головного мозку та особливості організації догляду за пацієнтами з порушеннями психіки в КЗ ТОР «Тернопільська університетська лікарня»

Models for logics and conditional constraints in automated proofs of termination

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-13770-4_3Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solving can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing results from linear algebra or real algebraic geometry are useful to deal with them but have received only scant attention to date. We investigate the definition and use of numeric models for logics and the resolution of linear and algebraic conditional constraints as unifying techniques for proving termination of declarative programs.Developed during a sabbatical year at UIUC. Supported by projects NSF CNS13-19109, MINECO TIN2010-21062-C02-02 and TIN2013-45732-C4-1-P, and GV BEST/2014/026 and PROMETEO/2011/052.Lucas Alba, S.; Meseguer, J. (2014). Models for logics and conditional constraints in automated proofs of termination. En Artificial Intelligence and Symbolic Computation. Springer Verlag (Germany). 9-20. https://doi.org/10.1007/978-3-319-13770-4_3S920Alarcón, B., Gutiérrez, R., Lucas, S., Navarro-Marset, R.: Proving Termination Properties with mu-term. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 201–208. Springer, Heidelberg (2011)Alarcón, B., Lucas, S., Navarro-Marset, R.: Using Matrix Interpretations over the Reals in Proofs of Termination. In: Proc. of PROLE 2009, pp. 255–264 (2009)Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)Contejean, E., Marché, C., Tomás, A.-P., Urbain, X.: Mechanically proving termination using polynomial interpretations. J. of Aut. Reas. 34(4), 325–363 (2006)Endrullis, J., Waldmann, J., Zantema, H.: Matrix Interpretations for Proving Termination of Term Rewriting. J. of Aut. Reas. 40(2-3), 195–220 (2008)Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal Termination. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 110–125. Springer, Heidelberg (2008)Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific (1998)Hudak, P., Peyton-Jones, S.J., Wadler, P.: Report on the Functional Programming Language Haskell: a non–strict, purely functional language. Sigplan Notices 27(5), 1–164 (1992)Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998(1), 1–61 (1998)Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications 39(3), 547–586 (2005)Lucas, S., Marché, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Information Processing Letters 95, 446–453 (2005)Lucas, S., Meseguer, J.: Proving Operational Termination of Declarative Programs in General Logics. In: Proc. of PPDP 2014, pp. 111–122. ACM Digital Library (2014)Lucas, S., Meseguer, J.: 2D Dependency Pairs for Proving Operational Termination of CTRSs. In: Proc. of WRLA 2014. LNCS, vol. 8663 (to appear, 2014)Lucas, S., Meseguer, J., Gutiérrez, R.: Extending the 2D DP Framework for CTRSs. In: Selected papers of LOPSTR 2014. LNCS (to appear, 2015)Meseguer, J.: General Logics. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium 1987, pp. 275–329. North-Holland (1989)Nguyen, M.T., de Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: Polynomial interpretations as a basis for termination of logic programs. Theory and Practice of Logic Programming 11(1), 33–63 (2011)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer (April 2002)Prestel, A., Delzell, C.N.: Positive Polynomials. In: From Hilbert’s 17th Problem to Real Algebra. Springer, Berlin (2001)Podelski, A., Rybalchenko, A.: A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239–251. Springer, Heidelberg (2004)Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons (1986)Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172–186. Springer, Heidelberg (1997

Head butting sheep: Kink Collisions in the Presence of False Vacua

We investigate numerically kink collisions in a 1+1 dimensional scalar field theory with multiple vacua. The domain wall model we are interested in involves two scalar fields and a potential term built from an asymmetric double well and (double) sine-Gordon potential together with an interaction term. Depending on the initial kink setup and impact velocities, the model allows for a wide range of scattering behaviours. Kinks can repel each other, annihilate, form true or false domain walls and reflect off each other

Lake Breezes in Southern Ontario and Their Relation to Tornado Climatology

Geostationary Operational Environmental Satellite (GOES) imagery is used to demonstrate the development of lake-breeze boundaries in southern Ontario under different synoptic conditions. The orientation of the gradient wind with respect to the shorelines is important in determining the location of such lines. When moderate winds (5–10 m s21) are parallel to straight sections of coastlines, cloud lines can extend well inland. In the region between Lakes Huron and Erie lake-breeze lines merge frequently, sometimes resulting in long-lasting stationary storms and attendant heavy rain and flooding. The influence of the lakes is apparent in the tornado climatology for the region: tornadoes appear to be suppressed in regions visited by lake-modified air and enhanced in regions favored by lake-breeze convergence lines. The cloud patterns in the case of a cold front interacting with merging lake-breeze boundaries are shown to be similar to those on a major tornado outbreak day. Two of the cases discussed are used as conceptual models to explain many of the features in the patterns of tornado touchdown locations. In general, it appears that the lakes suppress tornadoes in southern Ontario, compared with neighboring states and in particular in areas where southwest winds are onshore, but enhance tornado likelihood locally in areas of frequent lake-breeze activity. 1

Shape Analysis in the Absence of Pointers and Structure

discover properties of dynamic and/or mutable structures. We ask, “Is there an equivalent to shape analysis for purely functional programs, and if so, what ‘shapes ’ does it discover? ” By treating binding environments as dynamically allocated structures, by treating bindings as addresses, and by treating value environments as heaps, we argue that we can analyze the “shape ” of higher-order functions. To demonstrate this, we enrich an abstract-interpretive control-flow analysis with principles from shape analysis. In particular, we promote “anodization ” as a way to generalize both singleton abstraction and the notion of focusing, and we promote “binding invariants ” as the analog of shape predicates. Our analysis enables two optimizations known to be beyond the reach of control-flow analysis (globalization and super-β inlining) and one previously unknown optimization (higher-order rematerialization).

Does inter-vertebral range of motion increase after spinal manipulation? A prospective cohort study.

Background: Spinal manipulation for nonspecific neck pain is thought to work in part by improving inter-vertebral range of motion (IV-RoM), but it is difficult to measure this or determine whether it is related to clinical outcomes. Objectives: This study undertook to determine whether cervical spine flexion and extension IV-RoM increases after a course of spinal manipulation, to explore relationships between any IV-RoM increases and clinical outcomes and to compare palpation with objective measurement in the detection of hypo-mobile segments. Method: Thirty patients with nonspecific neck pain and 30 healthy controls matched for age and gender received quantitative fluoroscopy (QF) screenings to measure flexion and extension IV-RoM (C1-C6) at baseline and 4-week follow-up between September 2012-13. Patients received up to 12 neck manipulations and completed NRS, NDI and Euroqol 5D-5L at baseline, plus PGIC and satisfaction questionnaires at follow-up. IV-RoM accuracy, repeatability and hypo-mobility cut-offs were determined. Minimal detectable changes (MDC) over 4 weeks were calculated from controls. Patients and control IV-RoMs were compared at baseline as well as changes in patients over 4 weeks. Correlations between outcomes and the number of manipulations received and the agreement (Kappa) between palpated and QF-detected of hypo-mobile segments were calculated. Results: QF had high accuracy (worst RMS error 0.5o) and repeatability (highest SEM 1.1o, lowest ICC 0.90) for IV-RoM measurement. Hypo-mobility cut offs ranged from 0.8o to 3.5o. No outcome was significantly correlated with increased IV-RoM above MDC and there was no significant difference between the number of hypo-mobile segments in patients and controls at baseline or significant increases in IV-RoMs in patients. However, there was a modest and significant correlation between the number of manipulations received and the number of levels and directions whose IV-RoM increased beyond MDC (Rho=0.39, p=0.043). There was also no agreement between palpation and QF in identifying hypo-mobile segments (Kappa 0.04-0.06). Conclusions: This study found no differences in cervical sagittal IV-RoM between patients with non-specific neck pain and matched controls. There was a modest dose-response relationship between the number of manipulations given and number of levels increasing IV-RoM - providing evidence that neck manipulation has a mechanical effect at segmental levels. However, patient-reported outcomes were not related to this

Liberal Typing for Functional Logic Programs

We propose a new type system for functional logic programming which is more liberal than the classical Damas-Milner usually adopted, but it is also restrictive enough to ensure type soundness. Starting from Damas-Milner typing of expressions we propose a new notion of well-typed program that adds support for type-indexed functions, existential types, opaque higher-order patterns and generic functions-as shown by an extensive collection of examples that illustrate the possibilities of our proposal. In the negative side, the types of functions must be declared, and therefore types are checked but not inferred. Another consequence is that parametricity is lost, although the impact of this flaw is limited as "free theorems" were already compromised in functional logic programming because of non-determinism

Everything old is new again: Quoted Domain Specific Languages

We describe a new approach to domain specific languages (DSLs), called Quoted DSLs (QDSLs), that resurrects two old ideas: quotation, from McCarthy's Lisp of 1960, and the subformula property, from Gentzen's natural deduction of 1935. Quoted terms allow the DSL to share the syntax and type system of the host language. Normalising quoted terms ensures the subformula property, which guarantees that one can use higher-order types in the source while guaranteeing first-order types in the target, and enables using types to guide fusion. We test our ideas by re-implementing Feldspar, which was originally implemented as an Embedded DSL (EDSL), as a QDSL; and we compare the QDSL and EDSL variants